THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
نویسندگان
چکیده
منابع مشابه
The Generalized Stable Set Problem for Perfect Bidirected Graphs
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we can consider a problem whichi is a natural extension of the maximum weighted stable set problem for undirected graphs. Here we call this problem the generalized stable set problem. It is well known that the maximum weighted stable set problem is solvable in polynomial time for perfect undirected graphs. Perfe...
متن کاملA Semidefinite Programming Relaxation for the Generalized Stable Set Problem
In this paper, we generalize the theory of a convex set relaxation for the maximum weight stable set problem due to Grotschel, Lov asz and Schrijver to the generalized stable set problem. We de ne a convex set which serves as a relaxation problem, and show that optimizing a linear function over the set can be done in polynomial time. This implies that the generalized stable set problem for per...
متن کاملConic reduction of graphs for the stable set problem
The problem of finding a maximum stable (= independent) set of nodes in a graph has been tackled in various ways. One approach consists in using reduction methods, i.e., trying to associate to a given graphGwith (unknown) stability numberα(G) = max{|S|: S a stable set inG} a graphG1 with α(G1) = α(G)−pwhere p is a known positive integer (usually p= 1). Repeated application of the reduction prod...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولP5-free augmenting graphs and the maximum stable set problem
The complexity status of the maximum stable set problem in the class of P5-free graphs is unknown. In this paper, we 3rst propose a characterization of all connected P5-free augmenting graphs. We then use this characterization to detect families of subclasses of P5-free graphs where the maximum stable set problem has a polynomial time solution. These families extend several previously studied c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1997
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.40.401